Slew Merging Region Propagation for Bounded Slew and Skew Clock Tree Synthesis
نویسندگان
چکیده
منابع مشابه
Slew Control Methods for Tower Cranes
Today, tower cranes are in widespread use on construction sites all around the world. An important issue that arises when operating these cranes is the oscillatory behavior that occurs during payload transportation, which can have severe effects on safety as well as accuracy of payload delivery. Due to the nonlinear nature of the rotating crane motion, controlling these oscillations is a comple...
متن کاملPractical Bounded-Skew Clock Routing
In Clock routing research, such practical considerations as hierarchical buffering, rise-time and overshoot constraints, obstacleand legal location-checking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production...
متن کاملMinimum buffered routing with bounded capacitive load for slew rate and reliability control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal transition edges, and reduce delay uncertainty due to coupling noise. Bounding load capacitance also improves reliability with respect to hot-carrier oxide breakdown and AC self-heating in interconnects, and guarantees boun...
متن کاملMore Practical Bounded - Skew Clock Routing 1
Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot constraints, obstacleand legal location-checking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be e...
متن کاملMinimum-Cost Bounded-Skew Clock Routing
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2019
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2018.2874572